Optimizing reachability probabilities for a restricted class of Stochastic Hybrid Automata via Flowpipe-Construction

Stochastic hybrid automata (SHA) are a powerful tool to evaluate the dependability and safety of critical infrastructures. However, resolution nondeterminism, which is present in many purely models, often only implicitly considered SHA. This paper instead proposes algorithms for computing maximum minimum reachability probabilities singular with urgent transitions random clocks follow arbitrary continuous probability distributions. We borrow well-known approach from systems analysis, namely flowpipe construction, then extended optimize nondeterminism presence variables. Firstly, valuations ensure specific goal states extracted computed flowpipes secondly, by integrating over these valuations. compute history-dependent prophetic non-prophetic schedulers using set-based methods. The implementation featuring library HyPro complexity discussed detail. Two case studies nondeterministic choices show feasibility approach.